A New Approach to Determine the Minimal Polynomials of Binary Modified de Bruijn Sequences

A binary modified de Bruijn sequence is an infinite and periodic derived by removing a zero from the longest run of zeros in sequence. The minimal polynomial its unique least-degree characteristic polynomial. Leveraging recent characterization, we devise novel general approach to determine We translate characterization into problem identifying Hamiltonian cycle specially constructed graph. graph isomorphic Bruijn–Good Along way, demonstrate usefulness some computational tools joining method setup.